Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
نویسنده
چکیده
We deal with the problem of finding such an orientation of a given graph that the largest number of edges leaving a vertex (called the outdegree of the orientation) is small. For any ε ∈ (0, 1) we show an Õ(|E(G)|/ε) time algorithm which finds an orientation of an input graph G with outdegree at most d(1 + ε)d∗e, where d∗ is the maximum density of a subgraph of G. It is known that the optimal value of orientation outdegree is dd∗e. Our algorithm has applications in constructing labeling schemes, introduced by Kannan et al. in [18] and in approximating such graph density measures as arboricity, pseudoarboricity and maximum density. Our results improve over the previous, 2-approximation algorithms by Aichholzer et al. [1] (for orientation / pseudoarboricity), by Arikati et al. [3] (for arboricity) and by Charikar [5] (for maximum density).
منابع مشابه
Representations of Sparse Distributed Networks: A Locality-Sensitive Approach
In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a low outdegree orientation of a dynamic uniformly sparse graph. Specifically, for a dynamic graph on n-vertices, with arboricity bounded by α at all times, the BF algorithm supports edge updates in O(log n) amortized update time, while keeping the maximum outdegree in the graph bounded by O(α). Such an orientation provides a ...
متن کاملGraph Orientation Algorithms to Minimize the Maximum Outdegree
This paper studies the problem of orienting all edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guard arrangement for example, can be shown to be NP-hard generally. In this paper we first give optimal orientation algorithms which run in polynomial time for the following special cases: (i) the input is an un...
متن کاملGraph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree in the resulted directed graph. The problem is called MMO, and is a restricted variant of the well-known minimum makespan problem. As previous studies, it is shown that MMO is in P for trees, weak NP-hard for planar b...
متن کاملAn approximation algorithm for the link building problem
In this work we consider the problem of maximizing the PageRank of a given target node in a graph by adding k new links. We consider the case that the new links must point to the given target node (backlinks). Previous work shows that this problem has no fully polynomial time approximation schemes unless P = NP . We present a polynomial time algorithm yielding a PageRank value within a constant...
متن کاملNeighborhood Spanners of Minimal Outdegree 1
A geometric spanner with vertex set P IRD is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k 2 IN and the stretch factor f > 1 describing the ‘qualit...
متن کامل